Dual variables in two-stage linear programming under uncertainty
نویسندگان
چکیده
منابع مشابه
Linear programming under vacuous and possibilistic uncertainty
Consider the following (standard) linear programming problem: maximise a real-valued linear function CT x defined for optimisation variables x in Rn that have to satisfy the constraints Ax ≤ B, x ≥ 0, where the matrices A, B, and C are independent random variables that take values a, b, and c in Rm×n, Rm and Rn, respectively. Using an approach we developed in previous work [3], the problem is f...
متن کاملGeneralized linear fractional programming under interval uncertainty
Data in many real-life engineering and economical problems suffer from inexactness. Herein we assume that we are given some intervals in which the data can simultaneously and independently perturb. We consider a generalized linear fractional programming problem with interval data and present an efficient method for computing the range of optimal values. The method reduces the problem to solving...
متن کاملTwo-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenario represents a potential realization of the important parameters of the problem. In this paper we apply a recent approach, called flexibility, to solving two-stage flexible-choice problems. The first stage represents ...
متن کاملTwo Stage Stochastic Linear Programming with Gams
This document shows how to model two-stage stochastic linear programming problems in a GAMS environment. We will demonstrate using a small example, how GAMS can be used to formulate and solve this model as a large LP or using specialized stochastic solvers such as OSL-SE and DECIS. Finally a tailored implementation of the Benders Decomposition algorithm written in GAMS is used to solve the model.
متن کاملMitigating Uncertainty via Compromise Decisions in Two-Stage Stochastic Linear Programming: Variance Reduction
Stochastic Programming (SP) has long been considered as a well-justified yet computationally challenging paradigm for practical applications. Computational studies in the literature often involve approximating a large number of scenarios by using a small number of scenarios to be processed via deterministic solvers, or running Sample Average Approximation on some genre of high performance machi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1963
ISSN: 0022-247X
DOI: 10.1016/0022-247x(63)90096-9